home *** CD-ROM | disk | FTP | other *** search
Text File | 1995-03-10 | 356 b | 17 lines | [TEXT/3PRM] |
- module sieve
-
- // The standard Sieve of Eratosthenes.
-
- import StdEnv
-
- NrOfPrimes :== 1000
-
- // The sieve algorithm: generate an infinite list of all primes.
-
- Start = sieve [2..]
- where
- sieve [prime:rest] = [prime : sieve (filter prime rest)]
-
- filter p [h:tl] | h mod p == 0 = filter p tl
- = [h : filter p tl]
- filter p [] = []